Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

玉米生产施用锰渣混配肥的肥效试验

电解金属锰渣含有丰富的矿物质营养元素,将其处理加工成锰渣混配肥,在农作物生产中应用能促进作物的生长和提高产量,是可以开发的新型肥料资源.     

基于VC++的Web浏览器的实现

利用VC 的浏览器控件,实现Web浏览器的设计方法.     

基于TMS320VC5410的最小系统设计

TMS320VC5410是TI公司生产的一款定点数字信号处理(DSP)芯片。基于DSP的最小系统是以其简洁的硬件结构来实现DSP的一般功能,广泛应用于工业生产、教学、科研、电子设计等领域。主要介绍了基于TMS320VC5410的最小系统硬件电路设计方案,阐述了重要电路部分的抗干扰设计和软件调试过程中应注意的若干问题。最后提出了简单易行的软件调试方法以及部分程序代码。     

浅谈如何有效学习计算机软件知识

计算机软件知识的学习并不是完全线性的，而是不断循环往复、迭代的过程。本对如何深入、广泛、有效地学习计算机软件知识做出了一些探讨。     

基于CCS和DSK5402板的音频采集和回放程序设计

为了给程序设计作下基础,本文首先介绍了TI公司的TMS320VC5402和AIC(模拟接口电路)芯片TLC320AD50C的特点,最后着重介绍了利用DSK板上的TMS320C5402和TLC320AD50C实现音频采集并实时回放的软件设计过程,并利用CCS进行了模拟.     

一个用户接口管理系统

本文介绍了一个用户接口管理系统NUUIMS的设计和实现.重点叙述了该系统基于规范化目标用户接口模型的设计思想,系统组成及描述方法.文章也讨论了使用NUUIMS设计而成的用户接口的特点.     

C语言学习方法与实践的探讨

针对C语言程序设计课程本身的特点，分析学习过程中存在的问题，强调实践的必要性。结合一些学校课程改革和实践的经验．提出面向应用的，科学的学习内容、方法和模式。同时提高学习者的专业动手能力。     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002